Subring Homomorphic Encryption
نویسندگان
چکیده
In this paper, we construct subring homomorphic encryption scheme that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. In the scheme, each plaintext slot contains an integer in Zpl , rather than an element of GF(p) as in conventional homomorphic encryption schemes on cyclotomic rings. Our benchmark results indicate that the subring homomorphic encryption scheme is several times faster than HElib for mod-p integer plaintexts, due to its high parallelism of mod-p integer slot structure. We believe in that such plaintext structure composed of mod-p integer slots will be more natural, easy to handle, and significantly more efficient for many applications such as outsourced data mining, than conventional GF(p) slots.
منابع مشابه
Revisiting CK17 Linearly Homomorphic Ring Signature based on SIS
In SCIS 2017, Choi and Kim introduced the new linearly homomorphic ring signature scheme (CK17 scheme) based on the hardness of SIS problem, which overcomes the limitation of Boneh and Freeman’s scheme to implement homomorphic signatures to the real world scenario under multiple signers setting for a message. They replace the original sampling algorithm SamplePre() by Gentry et al. with Wang an...
متن کاملIntroduction to Homomorphic Encryption
Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe h...
متن کاملHomomorphic Authenticated Encryption Secure against Chosen-Ciphertext Attack
We study homomorphic authenticated encryption, where privacy and authenticity of data are protected simultaneously. We define homomorphic versions of various security notions for privacy and authenticity, and investigate relations between them. In particular, we show that it is possible to give a natural definition of IND-CCA for homomorphic authenticated encryption, unlike the case of homomorp...
متن کاملHomomorphic Encryption Schemes: Steps to Improve the Proficiency
Homomorphic encryption schemes are malleable by design. In this paper, we find different approaches to practical homomorphic encryption schemes. Partial homomorphic encryption schemes, we observe that the main bottleneck of this scheme is that it is capable of or adapted for turning easily from one to another of various tasks. To solve this problem, we propose general approach to improve the ve...
متن کاملHomomorphic Encryption with Access Policies: Characterization and New Constructions
A characterization of predicate encryption (PE) with support for homomorphic operations is presented and we describe the homomorphic properties of some existing PE constructions. Even for the special case of IBE, there are few known group-homomorphic cryptosystems. Our main construction is an XOR-homomorphic IBE scheme based on the quadratic residuosity problem (variant of the Cocks’ scheme), w...
متن کامل